Homotopic Convex Transformation: A New Landscape Smoothing Method for the Traveling Salesman Problem
نویسندگان
چکیده
منابع مشابه
The Landscape of the Traveling Salesman Problem
The landscapes of Traveling Salesman Problems are investigated by random walk techniques. The autocorrelation functions for diierent metrics on the space of tours are calculated. The landscape turns out to be AR(1) for symmetric TSPs. For asymmetric problems there can be a random contribution superimposed on an AR(1) behaviour.
متن کاملAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
متن کاملGenetic Operators, the Fitness Landscape and the Traveling Salesman Problem
Edge Recombination and Maximal Preservative Crossover (MPX) are two operators developed to preserve edge information for the Traveling Salesman Problem. Manderick et al. introduced the notion of a tness landscape to measure the tness correlation between parents and o spring under di erent recombination operators. The work on the tness landscape is extended by studying the interrelationship betw...
متن کاملA reactive bone route algorithm for solving the traveling salesman problem
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
متن کاملA New Memetic Algorithm for the Asymmetric Traveling Salesman Problem
This paper introduces a new memetic algorithm specialized for the asymmetric instances of the traveling salesman problem (ATSP). The method incorporates a new local search engine and many other features that contribute to its effectiveness, such as: (i) the topological organization of the population as a complete ternary tree with thirteen nodes; (ii) the hierarchical organization of the popula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cybernetics
سال: 2020
ISSN: 2168-2267,2168-2275
DOI: 10.1109/tcyb.2020.2981385